additively indecomposable造句
例句与造句
- Obviously 1 is additively indecomposable, since 0 + 0 No cardinal is additively indecomposable.
- Obviously 1 is additively indecomposable, since 0 + 0 No cardinal is additively indecomposable.
- *PM : proof of theorems in additively indecomposable, id = 4057-- WP guess : proof of theorems in additively indecomposable-- Status:
- *PM : proof of theorems in additively indecomposable, id = 4057-- WP guess : proof of theorems in additively indecomposable-- Status:
- If the ordinals less than ? are closed under addition and contain 0 then ? is occasionally called a ?-number ( see additively indecomposable ordinal ).
- It's difficult to find additively indecomposable in a sentence. 用additively indecomposable造句挺难的
- A ?-number ( see additively indecomposable ordinal # Multiplicatively indecomposable ) is an ordinal greater than 1 such that ?? = ? whenever 0 ? ?.
- From the continuity of addition in its right argument, we get that if \ beta and & alpha; is additively indecomposable, then \ beta + \ alpha = \ alpha.
- Similarly, one can consider " additively indecomposable ordinals " ( meaning a nonzero ordinal that is not the sum of two strictly smaller ordinals ) : the \ gamma-th additively indecomposable ordinal is indexed as \ omega ^ \ gamma.
- Similarly, one can consider " additively indecomposable ordinals " ( meaning a nonzero ordinal that is not the sum of two strictly smaller ordinals ) : the \ gamma-th additively indecomposable ordinal is indexed as \ omega ^ \ gamma.
- defined gamma numbers ( see additively indecomposable ordinal ) to be numbers ? > 0 such that ? + ? = ? whenever ? 1 such that ?? = ? whenever 0 2 such that ? ? = ? whenever 1 ?, and his delta numbers are those of the form ? ? ?.